Algorithms for Computing Cluster Dissimilarity between Rooted Phyloge- netic Trees
نویسنده
چکیده
Phylogenetic trees represent the historical evolutionary relationships between different species or organisms. Creating and maintaining a repository of phylogenetic trees is one of the major objectives of molecular evolution studies. One way of mining phylogenetic information databases would be to compare the trees by using a tree comparison measure. Presented here are a new dissimilarity measure for comparing rooted trees and three algorithms to efficiently compute it. This new measure operates on clusters of compared trees as in the case of standard Robinson-Foulds distance, but extracts more subtle differences between clusters, and thus may offer better discrimination than the Robinson-Foulds distance.
منابع مشابه
Phylogenetic Systematics
Since the advent of the theory of evolutio n, o ne of the tasks of biology has bee n to i nvestigate the phyloge netic relatio nship betwee n species. This task is especially impor ta nt because all of the differe nces which exist betwee n species, whether i n morphology, physiology , or ecology, i n ways of behavior, or even i n geographical distributio n, have evolved , like the species thems...
متن کاملOn a matching distance between rooted phylogenetic trees
The Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. U...
متن کاملMinimizing Phylogenetic Number to find Good Evolutionary Trees
Inferring phylogenetic trees is a fundamental problem in computational biology. We present a new objective criterion, the phylogenetic number, for evaluating evolutionary trees for species deened by biomolecular sequences or other qualitative characters. The phylogenetic number of a tree T is the maximum number of times that any given character state arises in T. By contrast, the classical pars...
متن کاملA Cluster Reduction for Computing the Subtree Distance between Phylogenies
Calculating the rooted subtree prune and regraft (rSPR) distance between two rooted binary phylogenetic trees is a frequently applied process in various areas of molecular evolution. However, computing this distance is an NP-hard problem and practical algorithms for computing it exactly are rare. In this paper, a divide-and-conquer approach to calculating the rSPR distance is established. This ...
متن کاملNodal distances for rooted phylogenetic trees
Dissimilarity measures for (possibly weighted) phylogenetic trees based on the comparison of their vectors of path lengths between pairs of taxa, have been present in the systematics literature since the early seventies. For rooted phylogenetic trees, however, these vectors can only separate non-weighted binary trees, and therefore these dissimilarity measures are metrics only on this class of ...
متن کامل